The Structure of Forward, Reverse, and Transverse Path Graphs in the Pattern Recognition Algorithms of Sellers
نویسندگان
چکیده
In [3], [4], [5] Sellers developes a dynamic programming pattern matching algorithm that generates forward, reverse, and transverse path graphs that determine the best resemblance (lowest cost) of a smaller string pattern inside a larger. In this paper we study the properties and structure of these graphs. We show that these path graphs can be decomposed into a small number of distinct block types, that are used to analyze graph structure. It is also shown that an exact pattern match results in a disconnected transverse path graph. keywords: Pattern Recognition, Connected Graph, Path Graph, Block Type, Evolutionary Distance.
منابع مشابه
A Flexible Integrated Forward/ Reverse Logistics Model with Random Path-based Memetic Algorithm
Due to business and environmental issues, the efficient design of an integrated forward/reverse logistics network has recently attracted more attention from researchers. The significance of transportation cost and customer satisfaction spurs an interest in developing a flexible network design model with different delivery paths. This paper proposes a flexible mixed-integer programming model to ...
متن کاملOn the use of Textural Features and Neural Networks for Leaf Recognition
for recognizing various types of plants, so automatic image recognition algorithms can extract to classify plant species and apply these features. Fast and accurate recognition of plants can have a significant impact on biodiversity management and increasing the effectiveness of the studies in this regard. These automatic methods have involved the development of recognition techniques and digi...
متن کاملDesigning a New Multi-objective Model for a Forward/Reverse Logistic Network Considering Customer Responsiveness and Quality Level
In today’s competitive world, the need to supply chain management (SCM) is more than ever. Since the purpose of logistic problems is minimizing the costs of organization to create favorable time and place for the products, SCM seek to create competitive advantage for their organizations and increase their productivity. This paper proposes a new multi-objective model for integrated forward / rev...
متن کاملDetour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملEffect of sound classification by neural networks in the recognition of human hearing
In this paper, we focus on two basic issues: (a) the classification of sound by neural networks based on frequency and sound intensity parameters (b) evaluating the health of different human ears as compared to of those a healthy person. Sound classification by a specific feed forward neural network with two inputs as frequency and sound intensity and two hidden layers is proposed. This process...
متن کامل